Application Conditions for Reactive Systems with Applications to Bisimulation Theory

نویسنده

  • Mathias Hülsbusch
چکیده

This paper presents generalized application conditions (GACs), a new formalism for nested application conditions. GACs are not only suitable for DPO rewriting, but for rewriting in reactive systems as well. The main theorem states that it is possible to construct an equivalent reactive system rule with a GAC for a DPO rule with application conditions under very mild conditions. The resulting reactive system rules live in the cospan category of the category C, in which the DPO rules live. It turns out that these GACs for reactive systems provide a slightly more powerful way to control the application of a rewriting rule, than it is possible in the original DPO setting. At the end, we give a short outlook on the applications of this formalism to the field of bisimulation theory, sketch our latest results and discuss future work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coinductive Reasoning for Contextual Graph-Rewriting

We introduce a comprehensive semantic theory of graph rewriting. The theory is operational, and therefore, lends itself to the application of coinductive principles. The central idea is recasting rewriting frameworks as reactive systems with the resulting contextual equivalences. Specifically, a graph rewriting system is associated with a labelled transition system, so that the corresponding bi...

متن کامل

Sortings & Bigraphs

In this dissertation, we study sortings for reactive and bigraphical reactive systems. Both classes of systems have transitions derived from reactions in such a way that if the category underlying the system in question has sufficient relative pushouts, then bisimulation on the derived transitions will be congruence. It turns out that every application of bigraphical reactive systems in the lit...

متن کامل

Bigraphical reactive systems: basic theory

A notion of bigraph is proposed as the basis for a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and a monograph representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which include versions of the -calculus and the ambient calculus. Bigraphs are shown to be a special ca...

متن کامل

Control Synthesis via Alternating Simulations and Open Maps

Control synthesis is slowly transcending its traditional application domain within engineering to find interesting and useful applications in computer science. Synthesis of interfaces, communication protocols or reactive programs from specifications are some examples that benefit from this design paradigm. In this paper we shed new light on the interplay between the fundamental notion of bisimu...

متن کامل

Deriving Bisimulation Congruences in the Presence of Negative Application Conditions

In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisimilarity is automatically a congruence. One important aspect that has not been studied so far is the treatment of reduction rules with negative application conditions. That is, a rule may only be applied if certain pat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ECEASST

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2011